Pairs of k-step reachability and m-step observability matrices

On the Maximal Degree of the K-Step Obrechkoff’s Method

On Observability and Reachability ?

Observability and reachability are important concepts in formal software development. While observability concepts allow to specify the required observable behavior of a program or system, reachability concepts are used to describe the underlying data in terms of data type constructors. In this paper we show that there is a duality between ob-servability and reachability, both from a methodolog...

Step matrices and the interpretation of homoplasy.

Assumptions about the costs of character change, coded in the form of a step matrix, determine most-parsimonious inferences of character evolution on phylogenies. We present a graphical approach to exploring the relationship between cost assumptions and evolutionary inferences from character data. The number of gains and losses of a binary trait on a phylogeny can be plotted over a range of cos...

MODIFIED K-STEP METHOD FOR SOLVING FUZZY INITIAL VALUE PROBLEMS

We are concerned with the development of a K−step method for the numerical solution of fuzzy initial value problems. Convergence and stability of the method are also proved in detail. Moreover, a specific method of order 4 is found. The numerical results show that the proposed fourth order method is efficient for solving fuzzy differential equations.

k-Step Relative Inductive Generalization

We introduce a new form of SAT-based symbolic model checking. One common idea in SAT-based symbolic model checking is to generate new clauses from states that can lead to property violations. Our previous work suggests applying induction to generalize from such states. While effective on some benchmarks, the main problem with inductive generalization is that not all such states can be inductive...